Hardware Assisted Elliptic Curve Cryptography∗
نویسندگان
چکیده
The increased vulnerability of network attached computers has elevated the need for strong security methods. At the same time, advancements in the the area of cryptography have risen to meet this challenge. This report concerns one particular form of cryptography which uses the mathematics of elliptic curves. In particular, the suitability of enhancing current methods with specialized hardware is considered. As a result, this report finds using Optimal Normal Basis (ONB) representation for ECC offers the most opportunities for hardware improvements.
منابع مشابه
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملAn FPGA implementation of elliptic curve cryptography for future secure web transaction
Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. So it would be more attractive to implement this unit using hardware than using software. In this pa...
متن کاملA Single Formula and its Implementation in FPGA for Elliptic Curve Point Addition Using Affine Representation
A formula for point addition in elliptic curves using a±ne representation and its implementation in FPGA is presented. The use of this new formula in hardware implementations of scalar multiplications for elliptic curve cryptography has the main advantages of: (i) reducing area for the implementations of elliptic curve point addition, and (ii) increasing the resistance to side channel attacks o...
متن کاملArchitectures for Unified Field Inversion with Applications in Elliptic Curve Cryptography
We present two new inversion algorithms for binary extension and prime fields, which are slightly modified versions of the Montgomery inverse algorithm. An hardware architecture implementing these algorithms is also introduced. In our proposed architecture, the field elements are represented using a multi-word format which allows a scalable and unified architecture to operate in a broad range o...
متن کامل